New Lagrangian function for nonconvex primal-dual decomposition
نویسندگان
چکیده
منابع مشابه
A primal-dual augmented Lagrangian
Nonlinearly constrained optimization problems can be solved by minimizing a sequence of simpler unconstrained or linearly constrained subproblems. In this paper, we discuss the formulation of subproblems in which the objective is a primal-dual generalization of the Hestenes-Powell augmented Lagrangian function. This generalization has the crucial feature that it is minimized with respect to bot...
متن کاملLagrangian Primal Dual Algorithms in Online Scheduling
We present a primal-dual approach to design algorithms in online scheduling. Our approach makes use of the Lagrangian weak duality and convexity to derive dual programs for problems which could be formulated as convex assignment problems. The constraints of the duals explicitly indicate the online decisions and naturally lead to competitive algorithms. We illustrate the advantages and the flexi...
متن کاملPrimal-Dual Interior Methods for Nonconvex Nonlinear Programming
Recently, infeasibility issues in interior methods for nonconvex nonlinear programming have been studied. In particular, it has been shown how many line-search interior methods may converge to an infeasible point which is on the boundary of the feasible region with respect to the inequality constraints. The convergence is such that the search direction does not tend to zero, but the step length...
متن کاملPerturbed Proximal Primal Dual Algorithm for Nonconvex Nonsmooth Optimization
In this paper we propose a perturbed proximal primal dual algorithm (PProx-PDA) for an important class of optimization problems whose objective is the sum of smooth (possibly nonconvex) and convex (possibly nonsmooth) functions subject to a linear equality constraint. This family of problems has applications in a number of statistical and engineering applications, for example in high-dimensiona...
متن کاملPrimal-Dual Lagrangian Transformation method for Convex Optimization
Received: date / Revised version: date Abstract. A class Ψ of strongly concave and smooth functions ψ : R → R with specific properties is used to transform the terms of the classical Lagrangian associated with the constraints. The transformation is scaled by a positive vector of scaling parameters, one for each constraint. Each step of the Lagrangian Transformation (LT) method alternates uncons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1987
ISSN: 0898-1221
DOI: 10.1016/0898-1221(87)90039-3